Entropy of Uncertain Random Variables wi h Application to Minimum Spanning Tree Problem
نویسندگان
چکیده
Entropy is a measure of the uncertainty associated with a variable whose value cannot be exactly predicted. Based on the notion of chance measure, a concept of uncertain random entropy is introduced and used to provide a quantitative measurement of the uncertainty associated with uncertain random variables and its properties are studied in this paper. Relative entropy is a measure of the difference between two distribution functions. In order to deal with the divergence of uncertain random variables via chance distributions, this paper proposes also the relative entropy for uncertain random variables, as well as it investigates some mathematical properties of this concept. As an application, a model is presented to formulate a minimum spanning tree problem with uncertain random edge weights involving a relative entropy chance distribution. Finally, a numerical example of an uncertain random network is put forward to illustrate the effectiveness of the proposed model.
منابع مشابه
Minimum Spanning Tree with Uncertain Random Weights
This paper considers the minimum spanning tree problem with uncertain random weights in an uncertain random network. The concept of uncertain random minimum spanning tree is initiated for minimum spanning tree problem with uncertain random edge weights. A model is presented to formulate a specific minimum spanning tree problem with uncertain random edge weights involving a distance chance distr...
متن کاملMinimum spanning tree problem of uncertain random network
Minimum spanning tree problem is a typical and fundamental problem in combinatorial optimization. Most of the existing literature is devoted to the case with deterministic or random weights. However, due to lack of data, a proportion of edge weights have to be estimated according to experts’ evaluations, which may be considered as uncertain variables. This paper focuses on the casewhere somewei...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملUncertain Quadratic Minimum Spanning Tree Problem
The quadratic minimum spanning tree problem is to find a spanning tree on a graph that minimizes a quadratic objective function of the edge weights. In this paper, the quadratic minimum spanning tree problem is concerned on the graph with edge weights being assumed as uncertain variables. The notion of the uncertain quadratic -minimum spanning tree is introduced by using the uncertain chance co...
متن کاملA Chance-Constrained Programming Model for Inverse Spanning Tree Problem with Uncertain Edge Weights
The inverse spanning tree problem is to make a given spanning tree be a minimum spanning tree on a connected graph via a minimum perturbation on its edge weights. In this paper, a chance-constrained programming model is proposed to handle the inverse spanning tree problem where the edge weights are assumed to be uncertain variables. It is shown that such an uncertain minimum spanning tree can b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
دوره 25 شماره
صفحات -
تاریخ انتشار 2017